The B&Mode Branch Predictor
نویسندگان
چکیده
Dynamic branch predictors are popular because they can deliver accurate branch prediction without changes to the instruction set architecture or pre-existing binaries. However, to achieve the desiredprediction accuracy, existing dynamic branch predictors require considerable amounts of hardware to minimize the integerence effects due to aliasing in the prediction tables. We propose a new dynamic predictor, the bi-mode predictor, which divides the prediction tables into two halves and, by dynamically determining the current “mode” of the program, selects the appropriate half of the table for prediction. This approach is shown to preserve the merits of global history basedprediction while reducing destructive aliasing and, as a result, improving prediction accuracy. Moreover, it is simple enough that it does not impact a processor’s cycle time. We conclude by conducting a comprehensive study into the mechanism underlying two-level dynamic predictors and investigate the criteria for their optimal designs. The analysis presented provides a general framework for studying branch predictors.
منابع مشابه
A Predictive Approach Based-sliding Mode Control
This Paper shows the synthesis of Sliding Mode Controller using model predictive structure of the process. The Smith predictor architecture is combined with the Sliding mode control theory. Two different linear models, with deadtime, are simulated and the performance of the controller is evaluated.
متن کاملRehashable BTB: An Adaptive Branch Target Buffer to Improve the Target Predictability of Java Code
Abstract. Java programs are increasing in popularity and prevalence on numerous platforms, including high-performance general-purpose processors. The dynamic characteristics of the Java runtime system present unique performance challenges for several aspects of microarchitecture design. In this work, we focus on the effects of indirect branches on branch target address prediction performance. R...
متن کاملDesign and Performance Evaluation of Global History Dynamic Branch Predictors
The importance of accurate branch prediction to future processors has been widely recognized. The correct prediction of conditional branch outcomes can help avoid pipeline bubbles and attendant loss in performance. In order to achieve high prediction accuracy, numerous dynamic branch prediction schemes that exploit branch correlation have recently been proposed. Several of the best predictors a...
متن کاملElastic History Buffer: A Low-Cost Method to Improve Branch Prediction Accuracy
Two-level dynamic branch predictors try to predict the outcomes of conditional branches using both a table of state counters associated with specific branch instructions and a buffer of recent branch outcomes to correlate the counters with specific branch histories. However, there is always a question of how much correlation to use, and some programs benefit from higher levels of correlation th...
متن کامل